package Euler24;

import java.util.*;
import ReusableCode.*;
//import com.google.common.collect.*;

public class LexicographicPermutations {

	public static void main(String[] args) {
		System.out.println("working...");
		
		/*List<Long> nums = Lists.newArrayList(0L, 1L, 2L, 3L, 4L, 5L, 6L, 7L, 8L, 9L);

		Collection<List<Long>> perms = Collections2.orderedPermutations(nums);
		
		Iterator<List<Long>> iter = perms.iterator();
		long count = 0;
		while(iter.hasNext())
		{
			count++;
			List<Long> next = iter.next();
			
			if(count == 1000000)
			{
				String temp = "";
				for(int i = 0; i < next.size(); i++)
				{
					temp += next.get(i);
				}
				
				System.out.println(temp);
			}
		}*/
	}
}
